package Day2025_03_22;

public class LeetCode10 {
    public boolean isMatch(String s, String p) {
        int m = s.length(), n = p.length();
        s = " " + s;
        p = " " + p;
        boolean[][] dp = new boolean[m + 1][n + 1];
        dp[0][0] = true;
        for (int i = 2; i <= n; i += 2) {
            if (p.charAt(i) == '*') dp[0][i] = true;
            else break;
        }
        for (int i = 1; i <= m; i++) {
            for (int j = 1; j <= n; j++) {
                if (p.charAt(j) == '*') dp[i][j] = dp[i][j - 2] || (s.charAt(i) == p.charAt(j - 1) || p.charAt(j - 1) == '.') && dp[i - 1][j];
                else dp[i][j] = dp[i - 1][j - 1] && (s.charAt(i) == p.charAt(j) || p.charAt(j) == '.');
            }
        }
        return dp[m][n];
    }
}
